Quantum algorithmic differentiation
نویسندگان
چکیده
In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We two versions algorithm, one which is fully and employees a classical step (hybrid approach). Since implementation elementary functions already possible on computers, scheme that propose can be easily applied. Moreover, since some steps (such as CNOT operator) (or will be) faster computer than one, our procedure may ultimately emonstrate has advantage relative its counterpart.
منابع مشابه
0 Quantum Algorithmic Entropy
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (" universal probability ") as a starting point, and define complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately , a quantum state is simple if it is within a small distance from a low-dim...
متن کاملQuantum Algorithmic Entropy
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and define complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimens...
متن کاملQuantum algorithmic information theory
The agenda of quantum algorithmic information theory, ordered ‘top-down,’ is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be base...
متن کاملFast Greeks by algorithmic differentiation
We show how algorithmic differentiation can be used to efficiently implement the pathwise derivative method for the calculation of option sensitivities using Monte Carlo simulations. The main practical difficulty of the pathwise derivative method is that it requires the differentiation of the payout function. For the type of structured options for which Monte Carlo simulations are usually emplo...
متن کاملAlgorithmic Differentiation through Convergent Loops
We consider an explicit iterate-to-fixedpoint operator and derive associated rules for both forward and reverse mode algorithmic differentiation. Like other AD transformation rules, these are exact and efficient. In this case, they generate code which itself invokes the iterate-to-fixedpoint operator. Loops which iterate until a variable changes less than some tolerance should be regarded as ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information & Computation
سال: 2021
ISSN: ['1533-7146']
DOI: https://doi.org/10.26421/qic21.1-2-5